Reliable Isotropic Tetrahedral Mesh Generation Based on an Advancing Front Method

نویسندگان

  • Yasushi Ito
  • Alan M. Shih
  • Bharat K. Soni
چکیده

In this paper, we propose a robust isotropic tetrahedral mesh generation method. An advancing front method is employed to control local mesh density and to easily preserve the original connectivity of boundary surfaces. Tetrahedra are created by each layer. Instead of preparing a background mesh for mesh spacing control, this information is estimated at the beginning of each layer at each node from the area of connecting triangles on the front and a user-specified stretching factor. An alternating digital tree (ADT) is prepared to correct the mesh spacing information and to perform geometric search efficiently. At the end of the mesh generation process, angle-based smoothing and Delaunay refinement are employed to enhance the resulting mesh quality. Surface meshes are prepared beforehand using a direct advancing front method for discrete surfaces extracted from computed tomography (CT) or magnetic resonance imaging (MRI) data. The algorithm is demonstrated with several biomedical models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Delaunay Tetrahedralization using an Advancing-Front Approach

This paper presents a procedure for eecient generation of three-dimensional unstructured meshes of tetrahedral elements. Initially, a constrained Delaunay mesh is generated wherein internal points are created using advancing-front point placement and are inserted using a Delaunay method. The overall procedure is applied repetitively until the mesh satisses a desired element size distribution fu...

متن کامل

High Quality Anisotropic Tetrahedral Mesh Generation Via Ellipsoidal Bubble Packing

This paper presents a new computational method for anisotropic tetrahedral meshing that (1) can control shapes of the elements by an arbitrary anisotropy function, and (2) can avoid ill-shaped elements induced from poorly distributed node locations. Our method creates a tetrahedral mesh in two steps. First our method obtains node locations through a physically based particle simulation, which w...

متن کامل

A Combined Octree-advancing Front Method for Tetrahedra and Anisotropic Surface Meshes

A more automatic method for generation of tetrahedra and directional surface meshes are the two developments presented in this paper. Un-structured grids are generated for complex 3-D ge-ometries including multi-body domains. A combined octree-advancing front method is presented for the generation of the unstructured surface mesh as well as the tetrahedral volume mesh. The unique feature of thi...

متن کامل

Receding Front Method: A New Approach Applied to Generate Hexahedral Meshes of Outer Domains

Two of the most successful methods to generate unstructured hexahedral meshes are the grid-based methods and the advancing front methods. On the one hand, the grid-based methods generate high quality elements in the inner part of the domain using an inside-outside approach. On the other hand, advancing front methods generate high quality hexahedra near the boundary using an outside-inside appro...

متن کامل

“Tetrahedral Mesh Generation Based on Node Insertion in Crystal Lattice Arrangements and Advancing-Front-DelaunayTriangulation”

A method of unstructured tetrahedral-mesh generation for general three-dimensional domains is presented. A conventional boundary representation is adopted as the basis for the description of solids with evolving geometry and topology. The geometry of surfaces is represented either analytically of by piecewise polynomial interpolation. A preliminary surface mesh is generated by an advancing fron...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004